A threshold mechanism ensures minimum-path flow in lightning discharge

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lightning Discharge and Fundamentals of Lightning Protection

A review of lightning protection concepts introduced by Benjamin Franklin (18th century) and James Clerk Maxwell (19th century) is given. Modern approaches to lightning protection of various structures and systems are discussed. In particular, the widely used electrogeometrical model (one version of which is the Rolling Sphere Method) and the topological shielding are presented. Bonding require...

متن کامل

The Minimum Universal Cost Flow in an Infeasible Flow Network

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

متن کامل

Integral flow decomposition with minimum longest path length

This paper concerns the problem of decomposing a network flow into an integral path flow such that the length of the longest path is minimized.It is shown that this problem isNP-hard in the strong sense.Two approximation algorithms are proposed for the problem:the longest path elimination(LPE)algorithm and the balanced flow propagation(BFP)algorithm.We analyze the properties of both algorithms ...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

A Fuzzy Random Minimum Cost Network Flow Programming Problem

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2021

ISSN: 2045-2322

DOI: 10.1038/s41598-020-79463-z